0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.13 % Command : run_E %s %d THM 0.12/0.34 % Computer : n020.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Aug 9 04:53:05 EDT 2022 0.12/0.34 % CPUTime : 0.19/0.48 Running higher-order on 8 cores theorem proving 0.19/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.48 # Version: 3.0pre003-ho 0.19/0.50 # Preprocessing class: HSMSSMSSMLLNHSN. 0.19/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.50 # Starting new_ho_10_cnf2 with 600s (5) cores 0.19/0.50 # Starting post_as_ho3 with 120s (1) cores 0.19/0.50 # Starting new_ho_12 with 120s (1) cores 0.19/0.50 # Starting new_bool_2 with 120s (1) cores 0.19/0.50 # new_ho_12 with pid 10651 completed with status 0 0.19/0.50 # Result found by new_ho_12 0.19/0.50 # Preprocessing class: HSMSSMSSMLLNHSN. 0.19/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.50 # Starting new_ho_10_cnf2 with 600s (5) cores 0.19/0.50 # Starting post_as_ho3 with 120s (1) cores 0.19/0.50 # Starting new_ho_12 with 120s (1) cores 0.19/0.50 # No SInE strategy applied 0.19/0.50 # Search class: HGUNS-FFSS32-SHSSMFNN 0.19/0.50 # partial match(2): HGUNS-FFMF32-SHSSMFNN 0.19/0.50 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.19/0.50 # Starting new_ho_10 with 65s (1) cores 0.19/0.50 # new_ho_10 with pid 10653 completed with status 0 0.19/0.50 # Result found by new_ho_10 0.19/0.50 # Preprocessing class: HSMSSMSSMLLNHSN. 0.19/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.50 # Starting new_ho_10_cnf2 with 600s (5) cores 0.19/0.50 # Starting post_as_ho3 with 120s (1) cores 0.19/0.50 # Starting new_ho_12 with 120s (1) cores 0.19/0.50 # No SInE strategy applied 0.19/0.50 # Search class: HGUNS-FFSS32-SHSSMFNN 0.19/0.50 # partial match(2): HGUNS-FFMF32-SHSSMFNN 0.19/0.50 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.19/0.50 # Starting new_ho_10 with 65s (1) cores 0.19/0.50 # Preprocessing time : 0.004 s 0.19/0.50 # Presaturation interreduction done 0.19/0.50 0.19/0.50 # Proof found! 0.19/0.50 # SZS status Theorem 0.19/0.50 # SZS output start CNFRefutation 0.19/0.50 thf(decl_22, type, qmltpeq: mu > mu > $i > $o). 0.19/0.50 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.19/0.50 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_26, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_27, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.19/0.50 thf(decl_28, type, mtrue: $i > $o). 0.19/0.50 thf(decl_29, type, mfalse: $i > $o). 0.19/0.50 thf(decl_30, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_31, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_32, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_33, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_34, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_35, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.19/0.50 thf(decl_36, type, exists_in_world: mu > $i > $o). 0.19/0.50 thf(decl_37, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.19/0.50 thf(decl_38, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.19/0.50 thf(decl_39, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.19/0.50 thf(decl_40, type, mreflexive: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_41, type, msymmetric: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_42, type, mserial: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_43, type, mtransitive: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_44, type, meuclidean: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_45, type, mpartially_functional: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_46, type, mfunctional: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_47, type, mweakly_dense: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_48, type, mweakly_connected: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_49, type, mweakly_directed: ($i > $i > $o) > $o). 0.19/0.50 thf(decl_50, type, mvalid: ($i > $o) > $o). 0.19/0.50 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.19/0.50 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.19/0.50 thf(decl_53, type, minvalid: ($i > $o) > $o). 0.19/0.50 thf(decl_54, type, rel_s4: $i > $i > $o). 0.19/0.50 thf(decl_55, type, mbox_s4: ($i > $o) > $i > $o). 0.19/0.50 thf(decl_56, type, mdia_s4: ($i > $o) > $i > $o). 0.19/0.50 thf(decl_57, type, member: mu > mu > $i > $o). 0.19/0.50 thf(decl_58, type, subset: mu > mu > $i > $o). 0.19/0.50 thf(decl_59, type, esk1_1: $i > mu). 0.19/0.50 thf(decl_60, type, esk2_0: $i). 0.19/0.50 thf(decl_61, type, esk3_0: mu). 0.19/0.50 thf(decl_62, type, esk4_0: mu). 0.19/0.50 thf(decl_63, type, esk5_0: mu). 0.19/0.50 thf(decl_64, type, esk6_3: $i > mu > mu > mu). 0.19/0.50 thf(mand, axiom, ((mand)=(^[X4:$i > $o, X5:$i > $o]:(mnot @ (mor @ (mnot @ X4) @ (mnot @ X5))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mand)). 0.19/0.50 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mnot)). 0.19/0.50 thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mor)). 0.19/0.50 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o]:(mor @ (mnot @ X4) @ X5))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mimplies)). 0.19/0.50 thf(mequiv, axiom, ((mequiv)=(^[X4:$i > $o, X5:$i > $o]:(mand @ (mimplies @ X4 @ X5) @ (mimplies @ X5 @ X4)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mequiv)). 0.19/0.50 thf(mforall_ind, axiom, ((mforall_ind)=(^[X10:mu > $i > $o, X3:$i]:(![X11:mu]:(((exists_in_world @ X11 @ X3)=>(X10 @ X11 @ X3)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mforall_ind)). 0.19/0.50 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mvalid)). 0.19/0.50 thf(subset_defn, axiom, (mvalid @ (mforall_ind @ (^[X20:mu]:(mforall_ind @ (^[X21:mu]:(mequiv @ (subset @ X20 @ X21) @ (mforall_ind @ (^[X22:mu]:(mimplies @ (member @ X22 @ X20) @ (member @ X22 @ X21)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', subset_defn)). 0.19/0.50 thf(prove_transitivity_of_subset, conjecture, (mvalid @ (mforall_ind @ (^[X20:mu]:(mforall_ind @ (^[X21:mu]:(mforall_ind @ (^[X22:mu]:(mimplies @ (mand @ (subset @ X20 @ X21) @ (subset @ X21 @ X22)) @ (subset @ X20 @ X22))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_transitivity_of_subset)). 0.19/0.50 thf(c_0_9, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])). 0.19/0.50 thf(c_0_10, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.19/0.50 thf(c_0_11, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.19/0.50 thf(c_0_12, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.19/0.50 thf(c_0_13, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(fof_simplification,[status(thm)],[mequiv])). 0.19/0.50 thf(c_0_14, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9, c_0_10]), c_0_11])). 0.19/0.50 thf(c_0_15, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_10]), c_0_11])). 0.19/0.50 thf(c_0_16, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13, c_0_14]), c_0_15])). 0.19/0.50 thf(c_0_17, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X11:mu]:(((exists_in_world @ X11 @ Z1)=>(Z0 @ X11 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_ind])). 0.19/0.50 thf(c_0_18, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.19/0.50 thf(c_0_19, plain, ![X43:$i, X42:mu]:(((exists_in_world @ X42 @ X43)=>![X41:mu]:(((exists_in_world @ X41 @ X43)=>~((~((~(subset @ X42 @ X41 @ X43)|![X40:mu]:(((exists_in_world @ X40 @ X43)=>(~(member @ X40 @ X42 @ X43)|(member @ X40 @ X41 @ X43))))))|~((~(![X40:mu]:(((exists_in_world @ X40 @ X43)=>(~(member @ X40 @ X42 @ X43)|(member @ X40 @ X41 @ X43)))))|(subset @ X42 @ X41 @ X43))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_defn]), c_0_15]), c_0_16]), c_0_17]), c_0_18])])). 0.19/0.50 thf(c_0_20, negated_conjecture, ~(![X39:$i, X38:mu]:(((exists_in_world @ X38 @ X39)=>![X37:mu]:(((exists_in_world @ X37 @ X39)=>![X36:mu]:(((exists_in_world @ X36 @ X39)=>(~(~((~(subset @ X38 @ X37 @ X39)|~(subset @ X37 @ X36 @ X39))))|(subset @ X38 @ X36 @ X39))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_transitivity_of_subset])]), c_0_14]), c_0_15]), c_0_17]), c_0_18])])). 0.19/0.50 thf(c_0_21, plain, ![X59:$i, X60:mu, X61:mu, X62:mu]:(((~(subset @ X60 @ X61 @ X59)|(~(exists_in_world @ X62 @ X59)|(~(member @ X62 @ X60 @ X59)|(member @ X62 @ X61 @ X59)))|~(exists_in_world @ X61 @ X59)|~(exists_in_world @ X60 @ X59))&(((exists_in_world @ (esk6_3 @ X59 @ X60 @ X61) @ X59)|(subset @ X60 @ X61 @ X59)|~(exists_in_world @ X61 @ X59)|~(exists_in_world @ X60 @ X59))&(((member @ (esk6_3 @ X59 @ X60 @ X61) @ X60 @ X59)|(subset @ X60 @ X61 @ X59)|~(exists_in_world @ X61 @ X59)|~(exists_in_world @ X60 @ X59))&(~(member @ (esk6_3 @ X59 @ X60 @ X61) @ X61 @ X59)|(subset @ X60 @ X61 @ X59)|~(exists_in_world @ X61 @ X59)|~(exists_in_world @ X60 @ X59)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])). 0.19/0.50 thf(c_0_22, negated_conjecture, ((exists_in_world @ esk3_0 @ esk2_0)&((exists_in_world @ esk4_0 @ esk2_0)&((exists_in_world @ esk5_0 @ esk2_0)&(((subset @ esk3_0 @ esk4_0 @ esk2_0)&(subset @ esk4_0 @ esk5_0 @ esk2_0))&~(subset @ esk3_0 @ esk5_0 @ esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])). 0.19/0.50 thf(c_0_23, plain, ![X18:mu, X13:mu, X11:mu, X3:$i]:(((member @ X18 @ X13 @ X3)|~((subset @ X11 @ X13 @ X3))|~((exists_in_world @ X18 @ X3))|~((member @ X18 @ X11 @ X3))|~((exists_in_world @ X13 @ X3))|~((exists_in_world @ X11 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.19/0.50 thf(c_0_24, negated_conjecture, (subset @ esk4_0 @ esk5_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_22])). 0.19/0.50 thf(c_0_25, negated_conjecture, (exists_in_world @ esk5_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_22])). 0.19/0.50 thf(c_0_26, negated_conjecture, (exists_in_world @ esk4_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_22])). 0.19/0.50 thf(c_0_27, plain, ![X13:mu, X11:mu, X3:$i]:(((subset @ X11 @ X13 @ X3)|~((member @ (esk6_3 @ X3 @ X11 @ X13) @ X13 @ X3))|~((exists_in_world @ X13 @ X3))|~((exists_in_world @ X11 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.19/0.50 thf(c_0_28, negated_conjecture, ![X11:mu]:(((member @ X11 @ esk5_0 @ esk2_0)|~((member @ X11 @ esk4_0 @ esk2_0))|~((exists_in_world @ X11 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25]), c_0_26])])). 0.19/0.50 thf(c_0_29, negated_conjecture, (subset @ esk3_0 @ esk4_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_22])). 0.19/0.50 thf(c_0_30, negated_conjecture, (exists_in_world @ esk3_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_22])). 0.19/0.50 thf(c_0_31, negated_conjecture, ![X11:mu]:(((subset @ X11 @ esk5_0 @ esk2_0)|~((member @ (esk6_3 @ esk2_0 @ X11 @ esk5_0) @ esk4_0 @ esk2_0))|~((exists_in_world @ (esk6_3 @ esk2_0 @ X11 @ esk5_0) @ esk2_0))|~((exists_in_world @ X11 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_25])])). 0.19/0.50 thf(c_0_32, negated_conjecture, ![X11:mu]:(((member @ X11 @ esk4_0 @ esk2_0)|~((member @ X11 @ esk3_0 @ esk2_0))|~((exists_in_world @ X11 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_29]), c_0_26]), c_0_30])])). 0.19/0.50 thf(c_0_33, negated_conjecture, ![X11:mu]:(((subset @ X11 @ esk5_0 @ esk2_0)|~((member @ (esk6_3 @ esk2_0 @ X11 @ esk5_0) @ esk3_0 @ esk2_0))|~((exists_in_world @ (esk6_3 @ esk2_0 @ X11 @ esk5_0) @ esk2_0))|~((exists_in_world @ X11 @ esk2_0)))), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.19/0.50 thf(c_0_34, plain, ![X13:mu, X11:mu, X3:$i]:(((member @ (esk6_3 @ X3 @ X11 @ X13) @ X11 @ X3)|(subset @ X11 @ X13 @ X3)|~((exists_in_world @ X13 @ X3))|~((exists_in_world @ X11 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.19/0.50 thf(c_0_35, negated_conjecture, ~((subset @ esk3_0 @ esk5_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.19/0.50 thf(c_0_36, negated_conjecture, ~((exists_in_world @ (esk6_3 @ esk2_0 @ esk3_0 @ esk5_0) @ esk2_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_30]), c_0_25])]), c_0_35])). 0.19/0.50 thf(c_0_37, plain, ![X13:mu, X11:mu, X3:$i]:(((exists_in_world @ (esk6_3 @ X3 @ X11 @ X13) @ X3)|(subset @ X11 @ X13 @ X3)|~((exists_in_world @ X13 @ X3))|~((exists_in_world @ X11 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.19/0.50 thf(c_0_38, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_25]), c_0_30])]), c_0_35]), ['proof']). 0.19/0.50 # SZS output end CNFRefutation 0.19/0.50 # Parsed axioms : 77 0.19/0.50 # Removed by relevancy pruning/SinE : 0 0.19/0.50 # Initial clauses : 53 0.19/0.50 # Removed in clause preprocessing : 38 0.19/0.50 # Initial clauses in saturation : 15 0.19/0.50 # Processed clauses : 37 0.19/0.50 # ...of these trivial : 0 0.19/0.50 # ...subsumed : 1 0.19/0.50 # ...remaining for further processing : 36 0.19/0.50 # Other redundant clauses eliminated : 0 0.19/0.50 # Clauses deleted for lack of memory : 0 0.19/0.50 # Backward-subsumed : 0 0.19/0.50 # Backward-rewritten : 0 0.19/0.50 # Generated clauses : 13 0.19/0.50 # ...of the previous two non-redundant : 7 0.19/0.50 # ...aggressively subsumed : 0 0.19/0.50 # Contextual simplify-reflections : 0 0.19/0.50 # Paramodulations : 13 0.19/0.50 # Factorizations : 0 0.19/0.50 # NegExts : 0 0.19/0.50 # Equation resolutions : 0 0.19/0.50 # Propositional unsat checks : 0 0.19/0.50 # Propositional check models : 0 0.19/0.50 # Propositional check unsatisfiable : 0 0.19/0.50 # Propositional clauses : 0 0.19/0.50 # Propositional clauses after purity: 0 0.19/0.50 # Propositional unsat core size : 0 0.19/0.50 # Propositional preprocessing time : 0.000 0.19/0.50 # Propositional encoding time : 0.000 0.19/0.50 # Propositional solver time : 0.000 0.19/0.50 # Success case prop preproc time : 0.000 0.19/0.50 # Success case prop encoding time : 0.000 0.19/0.50 # Success case prop solver time : 0.000 0.19/0.50 # Current number of processed clauses : 21 0.19/0.50 # Positive orientable unit clauses : 7 0.19/0.50 # Positive unorientable unit clauses: 0 0.19/0.50 # Negative unit clauses : 2 0.19/0.50 # Non-unit-clauses : 12 0.19/0.50 # Current number of unprocessed clauses: 0 0.19/0.50 # ...number of literals in the above : 0 0.19/0.50 # Current number of archived formulas : 0 0.19/0.50 # Current number of archived clauses : 15 0.19/0.50 # Clause-clause subsumption calls (NU) : 65 0.19/0.50 # Rec. Clause-clause subsumption calls : 29 0.19/0.50 # Non-unit clause-clause subsumptions : 1 0.19/0.50 # Unit Clause-clause subsumption calls : 11 0.19/0.50 # Rewrite failures with RHS unbound : 0 0.19/0.50 # BW rewrite match attempts : 0 0.19/0.50 # BW rewrite match successes : 0 0.19/0.50 # Condensation attempts : 37 0.19/0.50 # Condensation successes : 0 0.19/0.50 # Termbank termtop insertions : 4144 0.19/0.50 0.19/0.50 # ------------------------------------------------- 0.19/0.50 # User time : 0.007 s 0.19/0.50 # System time : 0.004 s 0.19/0.50 # Total time : 0.010 s 0.19/0.50 # Maximum resident set size: 2088 pages 0.19/0.50 0.19/0.50 # ------------------------------------------------- 0.19/0.50 # User time : 0.009 s 0.19/0.50 # System time : 0.006 s 0.19/0.50 # Total time : 0.015 s 0.19/0.50 # Maximum resident set size: 1804 pages 0.19/0.50 EOF